Fuzzy Querying of Semi-structured Data
نویسندگان
چکیده
Querying XML data is a well-explored topic thanks to powerful query languages such as XPath and XQuery. Both were designed to support the evaluation of binary predicates, which can be proven to be a limited approach to effective querying of XML data. In this paper, a fuzzy extension of the XPath query language is proposed. Its goal is to achieve more flexible querying through vague queries, which can be expressed exploiting fuzzy predicates and fuzzy connectives. We also provide an elegant definition of structure relaxation and primitive operators to span the space of relaxations. Finally we propose an approach to the fuzzy matching of XML trees: XPath provides a deep-equal function that can be used to assess whether two sequences are recursively equal. This can be restrictive, therefore we provide an extension named deep-similar to assess whether the sequences are similar both in content and in structure. We also provide the user with ranking functions to define how the results should be ranked and presented.
منابع مشابه
Study of Imperfect Information Representation and FSQL processing
-Structured Query Language (SQL) is a very powerful too, but it is unable to satisfy needs for data selection based on linguistic expressions and degree of truth. As we know that the information in real-world applications is often vague, imprecise and uncertain. Fuzzy logic breaks the rigid crisp logic boundaries and allows decision to be taken in a more realistic manner. In database context, s...
متن کاملFlexible queries in XML native databases
To date, most of the XML native databases (DB) flexible querying systems are based on exploiting the tree structure of their semi structured data (SSD). However, it becomes important to test the efficiency of Formal Concept Analysis (FCA) formalism for this type of data since it has been proved a great performance in the field of information retrieval (IR). So, the IR in XML databases based on ...
متن کامل